Two problems on commutation of languages
نویسنده
چکیده
We survey the known results on two old open problems on commutation of languages. The first problem, raised by Conway in 1971, is asking if the centralizer of a rational language must be rational as well – the centralizer of a language is the largest set of words commuting with that language. The second problem, proposed by Ratoandromanana in 1989, is asking for a characterization of those languages commuting with a given code – the conjecture is that the commutation with codes may be characterized as in free monoids. We present here simple proofs for the known results on these two problems.
منابع مشابه
The Influence of DC-Link Voltage on Commutation Torque Ripple of Brushless DC Motors with Two-Segment Pulse-width Modulation Control Method
The commutation process causes current ripple to be generated in the drive system of brushless DC (BLDC) motor. This, in turn, leads to output torque ripple. Mechanical vibration and acoustic noise are its influences which are undesirable phenomenon in some applications. A new method is presented in this paper which reduces torque ripple and commutation period in the entire range of motor speed...
متن کاملDecision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages
Let C be a class of automata (in a precise sense to be defined) and C be the class obtained by augmenting each automaton in C with finitely many reversal-bounded counters. We show that if the languages defined by C are effectively semilinear, then so are the languages defined by C , and, hence, their emptiness problem is decidable. We give examples of how this result can be used to show the dec...
متن کاملChallenges of Commutation
We consider a few problems connected to the commutation of languages, in particular nite ones. The goal is to emphasize the challenging nature of such simply formulated problems. In doing so we give a survey of results achieved during the last few years, restate several open problems and illustrate some approaches to attack such problems by two simple constructions.
متن کاملRegular languages and partial commutations
The closure of a regular language under a [partial] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial] commutation still regular? (2) Are there any robust classes of languages closed under [partial] commutation? We show that the class Pol(G) of polynomials of group languages is closed un...
متن کاملWhen Does Partial Commutative Closure Preserve Regularity?
The closure of a regular language under commutation or partial commutation has been extensively studied [1, 11, 12, 13], notably in connection with regular model checking [2, 3, 7] or in the study of Mazurkiewicz traces, one of the models of parallelism [14, 15, 16, 22]. We refer the reader to the survey [10, 9] or to the recent articles of Ochmański [17, 18, 19] for further references. In this...
متن کامل